On the computing of the generalized order-k Pell numbers in log time
نویسندگان
چکیده
In this paper, we consider the generalized order-k Pell numbers and present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves. The theoretical basis of using a matrix method for deriving the algorithm is also discussed. 2006 Elsevier Inc. All rights reserved.
منابع مشابه
The generalized order-k Fibonacci–Pell sequence by matrix methods
In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...
متن کاملOn the sum of Pell and Jacobsthal numbers by matrix method
In this paper, we define two $n$-square upper Hessenberg matrices one of which corresponds to the adjacency matrix of a directed pseudo graph. We investigate relations between permanents and determinants of these upper Hessenberg matrices, and sum formulas of the well-known Pell and Jacobsthal sequences. Finally, we present two Maple 13 procedures in order to calculate permanents of t...
متن کاملTHE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-k PELL NUMBERS
In this paper we give a new generalization of the Pell numbers in matrix representation. Also we extend the matrix representation and we show that the sums of the generalized order-k Pell numbers could be derived directly using this representation. Further we present some identities, the generalized Binet formula and combinatorial representation of the generalized order-k Pell numbers.
متن کاملOn The Usual Fibonacci and Generalized Order-k Pell Numbers
In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these mat...
متن کاملFormulas For Sums Of Generalized Order-k Fibonacci Type Sequences By Matrix Methods
In this paper, we give formulas for the sums of generalized order-k Fibonacci, Pell and similar other sequences which we obtain using matrix methods. As applications, we give explicit formulas for the Tribonacci and Tetranacci numbers. 1. Introduction The well-known Fibonacci sequence fFng is de ned for n > 2 by Fn+1 = Fn + Fn 1 where F1 = F2 = 1: The well-known Pell sequence fPng is de ned for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 181 شماره
صفحات -
تاریخ انتشار 2006